Taylor and Lyubeznik Resolutions via Gröbner Bases
نویسنده
چکیده
Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that already a subcomplex defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Gröbner bases, whereas the Lyubeznik resolution is a consequence of Buchberger’s chain criterion. Finally, we relate Fröberg’s contracting homotopy for the Taylor complex to normal forms with respect to our Gröbner bases and use it to derive a splitting homotopy that leads to the Lyubeznik complex. 1. The Taylor and the Lyubeznik Resolution Let M = {m1, . . . , mr} ⊂ P = k[x1, . . . , xn] be a finite set of monomials. Taylor [1960] constructed in her Ph.D. thesis an explicit free resolution of the monomial ideal J = 〈M〉. The associated complex consists essentially of an exterior algebra and a differential defined via the least common multiples of subsets of M. Let V be some r-dimensional k-vector space with the basis {v1, . . . , vr}. If k = (k1, . . . , kq) is a sequence of integers with 1 ≤ k1 < k2 < · · · < kq ≤ r, we set mk = lcm(mk1 , . . . , mkq). The P-module Tq = P ⊗ Λ V is then freely generated by all wedge products vk = vk1 ∧ · · · ∧ vkq . Finally, we introduce on the algebra T = P ⊗ ΛV the following P-linear differential δ:
منابع مشابه
Computing syzygies with Gröbner bases
The aim of this article is to motivate the inclusion of Gröbner bases in algebraic geometry via the computation of syzygies. In particular, we will discuss Gröbner bases for finite modules over polynomial rings, and mention how this tool can be used to compute minimal free resolutions of graded finite modules. We won’t prove any results. Instead, we refer the reader to the references at the end...
متن کاملStrategies for Computing Minimal Free Resolutions
One of the most important computations in algebraic geometry or commutative algebra that a computer algebra system should provide is the computation of finite free resolutions of ideals and modules. Resolutions are used as an aid to understand the subtle nature of modules and are also a basis of further computations, such as computing sheaf cohomology, local cohomology, Ext, Tor, etc. Modern me...
متن کاملSyzygies, finite length modules, and random curves
We apply the theory of Gröbner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
متن کاملNoncommutative Gröbner Bases for the Commutator Ideal
Let I denote the commutator ideal in the free associative algebra on m variables over an arbitrary field. In this article we prove there are exactly m! finite Gröbner bases for I , and uncountably many infinite Gröbner bases for I with respect to total division orderings. In addition, for m = 3 we give a complete description of its universal Gröbner basis. Let A be a finite set and let K be a f...
متن کاملm at h . A G ] 1 2 Ja n 20 01 Resolutions of Fat Point Ideals involving 8 General Points of P
The main result, Theorem 1, provides an algorithm for determining the minimal free resolution of fat point subschemes of P involving up to 8 general points of arbitrary multiplicities; the resolutions obtained hold for any algebraically closed field, independent of the characteristic. The algorithm works by giving a formula in nice cases, and a reduction to the nice cases otherwise. The algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 34 شماره
صفحات -
تاریخ انتشار 2002